Geometric orderings of intersecting translates and their applications

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics of intersecting brane systems – Classification and their applications –

We present dynamical intersecting brane solutions in higher-dimensional gravitational theory coupled to dilaton and several forms. Assuming the forms of metric, form fields, and dilaton field, we give a complete classification of dynamical intersecting brane solutions with/without M-waves and Kaluza-Klein monopoles in eleven-dimensional supergravity. We apply these solutions to cosmology and bl...

متن کامل

Geometric Data Structures and Their Selected Applications

Finding the shortest path between two positions is a fundamental problem in transportation, routing, and communications applications. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to find a collision-free path from a starting to a target position. This task has many specific formulations depending on the shape of obstacles, allowabl...

متن کامل

Davenport-Schinzel sequences and their geometric applications

An (n; s) Davenport{Schinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation a b a b of length s + 2 between two distinct symbols a and b. The close relationship between Davenport{Schinzel sequences and the c...

متن کامل

Linear Orderings of Random Geometric Graphs

In random geometric graphs, vertices are randomly distributed on [0, 1] and pairs of vertices are connected by edges whenever they are sufficiently close together. Layout problems seek a linear ordering of the vertices of a graph such that a certain measure is minimized. In this paper, we study several layout problems on random geometric graphs: Bandwidth, Minimum Linear Arrangement, Minimum Cu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 1997

ISSN: 0925-7721

DOI: 10.1016/0925-7721(95)00043-7